Potential destination discovery for low predictability individuals based on knowledge graph
نویسندگان
چکیده
Travelers may travel to locations they have never visited, which we call potential destinations of them. Especially under a very limited observation, travelers tend show random movement patterns and usually large number destinations, make them difficult handle for mobility prediction (e.g., destination prediction). In this paper, develop new knowledge graph-based framework (PDPFKG) discovery low predictability by considering trip association relationships between We first construct graph (TKG) model the scenario entities travelers, time information) their relationships, in introduce concept private relationship complexity reduction. Then modified embedding algorithm is implemented optimize overall representation. Based on (TKGEM), possible ranking individuals’ unobserved be chosen future can obtained calculating triples’ distance. Empirically. PDPFKG tested using an anonymous vehicular dataset from 138 intersections equipped with video-based vehicle detection systems Xuancheng city, China. The results that outperforms baseline methods overall, rankings given it strong consistency travelers’ behavior choosing aggregated level. Besides, experiments indicate performance would further improved valid data introduction. Finally, provide comprehensive discussion about innovative points methodology share some findings understandings. • A generic discovery. Handle individuals focusing information Higher ranked are statistically more likely individuals. Results could introducing data.
منابع مشابه
Approaches to Parallel Graph-Based Knowledge Discovery
The large amount of data collected today is quickly overwhelming researchers' abilities to interpret the data and discover interesting patterns. Knowledge discovery and data mining systems contain the potential to automate the interpretation process, but these approaches frequently utilize computationally expensive algorithms. In particular, scientific discovery systems focus on the utilization...
متن کاملGraph-Based Knowledge Discovery: Compression versus Frequency
There are two primary types of graph-based data miners: frequent subgraph and compression-based miners. With frequent subgraph miners, the most interesting substructure is the largest one (or ones) that meet the minimum support. Whereas, compression-based graph miners discover those subgraphs that maximize the amount of compression that a particular substructure provides a graph. The algorithms...
متن کاملHandling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values with an exact matching criterion), with the limitation to work with domains that do not have this type of attribute or finding patterns without numeric attributes. In this work, we propose a new approach for the numeric...
متن کاملan appropriate model for exchange rate predictability in iran: comparing potential forecastability
nowadays in trade and economic issues, prediction is proposed as the most important branch of science. existence of effective variables, caused various sectors of the economic and business executives to prefer having mechanisms which can be used in their decisions. in recent years, several advances have led to various challenges in the science of forecasting. economical managers in various fi...
application of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C-emerging Technologies
سال: 2022
ISSN: ['1879-2359', '0968-090X']
DOI: https://doi.org/10.1016/j.trc.2022.103928